A fast motion estimation algorithm equivalent to exhaustive search
نویسنده
چکیده
In this paper, a fast algorithm is proposed for block motion estimation for video sequences. The proposed algorithm is proven to be equivalent to exhaustive search. In a multiresolution approach, it uses mathematically derived threshold to prune search candidates whose low-resolution versions are too far from the low resolution version of the block for which a best match is sought. Experimental results show that speed ups of around 36, compared to full search, may be achieved, for some typical test video sequences. This is the fastest full-search-equivalent motion estimation reported in the literature to date, and has speed ups comparable to inexact fast motion estimation methods.
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملBlock - Based Fast Motion EstimationAlgorithms in Video Compression
This paper introduces several block-based fast motion estimation algorithms in video compression. Two classes of algorithms are summarized. The three-step search algorithm is examined along with its improvements. Other algorithms based on simple optimization techniques and pixel/block decimation techniques are also reviewed. Advantages of each algorithm are given in terms of motion estimation c...
متن کاملComparison of Fast Block Matching Algorithms for Motion Estimation
This paper is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares several different types of block matching algorithms that ranges from the very basic Exhaustive Search to the recent fast adaptive algorithms like Adaptive Rood pattern Search Algorithm. The algorithms that are evaluated in this paper are widely accepted by the vid...
متن کاملA Fast Block Matching Algorithm in Feature Domain
Motion estimation is a computation-intensive procedure used in many coding schemes such as MPEG and H.261 to remove temporal redundancy in image sequences. In this paper, we describe an algorithm which can reduce computation significantly and achieve close-to-optimal performance in mean absolute difference(MAD) sense. In contrast with the conventional exhaustive search in pixel domain, we searc...
متن کاملFinite - State Vector Quantization for Block - Matching Motion Estimation
Block-matching algorithms (BMA) are commonly used in image sequence coding for motion estimation. Even though the estimation of block motion vectors by an exhaustive search is optimal, the computational complexity precludes its usage in many real-time codec applications. In this paper, we present a novel vector quantizer (VQ) based architecture for BMA o ering sizeable reduction in the number o...
متن کامل